搜索资源列表
Thuffh
- 利用matlab编程环境，采用算术编码的方式实现现字符串的无损压缩 ，经测试可直接使用。 -Matlab programming environment using arithmetic coding to achieve lossless compression is now a string, has been tested and can be used directly.
Huff_Compress
- 无损压缩算法：哈夫曼编码。哈夫曼算法的过程为：统计原始数据中各字符出现的频率；所有字符按频率降序排列；建立哈夫曼树：将哈夫曼树存入结果数据；重新编码原始数据到结果数据。-Lossless compression algorithms: Huffman coding. Huffman algorithm is the process: the original data in the statistical frequency of occurrence of each character al
RDTLT
- 基于Lossy-to-Lossless Image Compression Based on Reversible Integer TDLT/KLT的压缩算法的matlab实现，在增加ROI编码模块，算法详细可以查看论文《Lossy-to-lossless image compression based on multiplier-less reversible integer time domain lapped transform》。程序由main.m函数开始运行，输入参数有3个，分
Advertis
- In computer science and information theory, data compression, source coding,[1] or bit-rate reduction involves encoding information using fewer bits than the original representation. Compression can be either be lossy or lossless. Lossless compressio
FELICS
- In computer science and information theory, data compression, source coding,[1] or bit-rate reduction involves encoding information using fewer bits than the original representation. Compression can be either be lossy or lossless. Lossless compressio
audio-compression-program
- 音频无损压缩程序，加入随机噪声，利用前向预测算出预测误差，再用熵编码，组帧，最后解码-Lossless audio compression program, by adding random noise to the prediction error is calculated using the forward prediction, and then entropy coding, framing, and finally decoding
huffman
- 任选一种无损编码方式，通过C++编程实现。 要求：1) 字符串的输入是手工输入的； 2) 在屏幕上显示编码结果，例如，如果选用huffman编码，则要显示字符串的编码及平均码长；-Optionally, a lossless compression method, through the programming of C++. Requirements: 1) the input string is manual input 2) shows the coding resul
Authority--Huffman.Codec
- 霍夫曼（Huffman）编码是1952年为文本文件而建立，是一种统计编码。属于无损压缩编码。-Hoffman (Huffman) coding is established in 1952 as a text file, is a statistical coding. Belong lossless compression encoding.
CPP
- 增进对算术编码和Q编码器的认识，加深对图像处理理论方面的理解，熟悉VC++程序的设计和实现、设计方案原理图、理论知识的学习、程序编写、并详细分析其实现过程，使学生掌握算术编码处理图像的无损压缩以及Q编码器的实现-Enhance understanding of arithmetic coding and Q encoder, deepen the understanding of the theoretical aspects of image processing, familiar with
huffman
- huffman编码，无损压缩，matlab源码，实现图像压缩，很有意思-huffman coding, lossless compression, matlab source code, image compression, very interesting
huffmanzongchengxu
- 对不同格式数字图像进行哈夫曼编码压缩，通过matlab软件仿真，最后得到了压缩图像，实现了本课题的基本要求。通过仿真得知哈夫曼编码为无损压缩。-Huffman coding digital image in a different format, by Matlab software emulation, finally got the compressed image, to achieve the basic requirements of this topic. Through simul
huffman
- 利用赫夫曼编码的实现原理码对数据进行无损压缩，设计一个实现Huffman压缩的编码和解码的程序。具体要求如下：读入待压缩的文本文件； 2）统计分析文本文件中各字符的出现频度，以频度作为构造Huffman树的权值。根据各字符出现的不同频度构造Huffman树，然后规定每种字符的Huffman编码。再次读入待压缩的文本文件，然后根据各字符的Huffman编码逐一替代，将得到的编码流写入到新的文件中，并且计算压缩率。 5）解码过程：先读入上一步骤得到的新文件，将其看作比特流，根据Huffman
codeword
- 无损预测编码的主函数和子函数，以及指数哥伦布编码的源代码-Lossless predictive coding main function and subfunction, and Exponential-Golomb coding of source code
1-s2.0-S0030402613001447-main
- The wavelet transform divides image into different but interrelated multi-resolution and multi-level sub-bands, so quantization coding strategy of image wavelet coefficient has great flexibility. To address to energy aggregation and correlated fe
SRC
- 编写一个基于哈夫曼树编码原理的算法对文件进行无损的压缩和解压缩-Write a Huffman tree coding theory based algorithm for lossless file compression and decompression
huofuman
- 霍夫曼图像压缩编码，无损压缩，压缩率为2倍，压缩效果很好。-Image compression Huffman coding, lossless compression, the compression rate is 2 times the compression works well.
suanshubianma--MATLAB
- 算术编码的matlab实现 ，便于无损压缩 -Arithmetic coding matlab implementation, ease of lossless compression
code
- 读入指定的音频序列，并对其进行无损预测编码和DM调制编码-Read into the specified audio sequences, and its lossless predictive coding and modulation coding DM
Arithmatic
- arithmatic 编码，是图像压缩的主要算法之一，是一种无损数据压缩方法，也是一种熵编码的方法。-arithmatic coding is one of the main image compression algorithm and a lossless data compression method, but also a method of entropy coding.
arithcode
- Arithmetic coding is a form of entropy encoding used in lossless data compression. Normally, a string of characters such as the words "hello there" is represented using a fixed number of bits per character, as in the ASCII code. When a string is conv